On Distinguishing Translates of Measures
نویسندگان
چکیده
منابع مشابه
Admissible and Singular Translates of Measures on Vector Spaces
We provide a general setting for studying admissible and singular translates of measures on linear spaces. We apply our results to measures on D[0, 1]. Further, we show that in many cases convex, balanced, bounded, and complete subsets of the admissible translates are compact. In addition, we generalize Sudakov's theorem on the characterization of certain quasi-invariant sets to separable refle...
متن کاملNon-divergence of Translates of Certain Algebraic Measures
Let G and H ⊂ G be connected reductive real algebraic groups defined over Q, and admitting no nontrivial Q-characters. Let Γ ⊂ G(Q) be an arithmetic lattice in G, and π : G→ Γ\G be the natural quotient map. Let μH denote the H-invariant probability measure on the closed orbit π(H). Suppose that π(Z(H)) is compact, where Z(H) denotes the centralizer of H in G. We prove that the set {μH · g : g ∈...
متن کاملOn the visibility graph of convex translates
We show that the visibility graph of a set of non-intersecting translates of the same compact convex object in R always contains a Hamiltonian path. Furthermore, we show that every other edge in the Hamiltonian path can be used to obtain a perfect matching that is realized by a set of non-intersecting lines of sight. ? 2001 Elsevier Science B.V. All rights reserved.
متن کاملOn the maximum number of translates
Given a finite set P ⊆ Rd, called a pattern, tP (n) denotes the maximum number of translated copies of P determined by n points in Rd. We give the exact value of tP (n) when P is a rational simplex, that is, the points of P are rationally affinely independent. In this case, we prove that tP (n) = n −mr (n), where r is the rational affine dimension of P , and mr (n) is the r-Kruskal-Macaulay fun...
متن کاملOn covering by translates of a set
In this paper we study the minimal number τ(S,G) of translates of an arbitrary subset S of a group G needed to cover the group, and related notions of the efficiency of such coverings. We focus mainly on finite subsets in discrete groups, reviewing the classical results in this area, and generalizing them to a much broader context. For example, we show that while the worst-case efficiency when ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Mathematical Statistics
سال: 1969
ISSN: 0003-4851
DOI: 10.1214/aoms/1177697389